Decompositions of matrices into potent and square-zero matrices

نویسندگان

چکیده

In order to find a suitable expression of an arbitrary square matrix over finite commutative ring, we prove that every such is always representable as sum potent and nilpotent at most two when the Jacobson radical ring has zero-square. This somewhat extends results ours in Linear Multilinear Algebra (2022) established for matrices considered on fields. Our main theorem also improves recent due Abyzov et al. Mat. Zametki (2017), Šter Appl. (2018) Shitov Indag. Math. (2019).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero-sum Square Matrices

Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the sum of each row of B and the sum of each column of B is a multiple of p. Let M(p, k) denote the least integer m for which every square matrix of order at least m has a square submatrix of order k which is zero-sum mod p. In this paper we supply upper and lower bounds for M(p, k). In...

متن کامل

On the square root of quadratic matrices

Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.

متن کامل

ON SELBERG-TYPE SQUARE MATRICES INTEGRALS

In this paper we consider Selberg-type square matrices integrals with focus on Kummer-beta types I & II integrals. For generality of the results for real normed division algebras, the generalized matrix variate Kummer-beta types I & II are defined under the abstract algebra. Then Selberg-type integrals are calculated under orthogonal transformations.

متن کامل

A Coding Theory Bound and Zero-Sum Square Matrices

For a code C = C(n,M) the level k code of C, denoted Ck, is the set of all vectors resulting from a linear combination of precisely k distinct codewords of C. We prove that if k is any positive integer divisible by 8, and n = γk, M = βk ≥ 2k then there is a codeword in Ck whose weight is either 0 or at most n/2− n( 1 8γ − 6 (4β−2)2 ) + 1. In particular, if γ < (4β − 2) /48 then there is a codew...

متن کامل

E-Clean Matrices and Unit-Regular Matrices

Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Algebra and Computation

سال: 2022

ISSN: ['0218-1967', '1793-6500']

DOI: https://doi.org/10.1142/s0218196722500126